Symmetric Convex Sets with Minimal Gaussian Surface Area
ثبت نشده
چکیده
Let Ω ⊆ R have minimal Gaussian surface area among all sets satisfying Ω = −Ω with fixed Gaussian volume. Let A = Ax be the second fundamental form of ∂Ω at x, i.e. A is the matrix of first order partial derivatives of the unit normal vector at x ∈ ∂Ω. For any x = (x1, . . . , xn+1) ∈ R, let γn(x) = (2π)−n/2e−(x 2 1+···+x 2 n+1. Let ‖A‖ be the sum of the squares of the entries of A, and let ‖A‖2→2 denote the `2 operator norm of A. It is shown that if Ω or Ω is convex, and if either ∫ ∂Ω (‖Ax‖ − 1)γn(x)dx > 0 or ∫ ∂Ω ( ‖Ax‖ − 1 + 2 sup y∈∂Ω ‖Ay‖2→2 ) γn(x)dx < 0, then ∂Ω must be a round cylinder. That is, except for the case that the average value of ‖A‖ is slightly less than 1, we resolve the convex case of a question of Barthe from 2001. The main tool is the Colding-Minicozzi theory for Gaussian minimal surfaces, which studies eigenfunctions of the Ornstein-Uhlenbeck type operator L = ∆− 〈x,∇〉+ ‖A‖ + 1 associated to the surface ∂Ω. A key new ingredient is the use of a randomly chosen degree 2 polynomial in the second variation formula for the Gaussian surface area. Our actual results are a bit more general than the above statement. Also, some of our results hold without the assumption of convexity.
منابع مشابه
Symmetric Convex Sets with Minimal Gaussian Surface Area
Abstract. Let Ω ⊆ R have minimal Gaussian surface area among all sets satisfying Ω = −Ω with fixed Gaussian volume. Let A = Ax be the second fundamental form of ∂Ω at x, i.e. A is the matrix of first order partial derivatives of the unit normal vector at x ∈ ∂Ω. For any x = (x1, . . . , xn+1) ∈ R, let γn(x) = (2π)−n/2e 2 1+···+x 2 n+1. Let ‖A‖2 be the sum of the squares of the entries of A, and...
متن کاملGaussian Correlation Conjecture for Symmetric Convex Sets
Gaussian correlation conjecture states that the Gaussian measure of the intersection of two symmetric convex sets is greater or equal to the product of the measures. In this paper, firstly we prove that the inequality holds when one of the two convex sets is the intersection of finite centered ellipsoids and the other one is simply symmetric. Then we prove that any symmetric convex set can be a...
متن کاملGaussian mixtures: entropy and geometric inequalities
A symmetric random variable is called a Gaussian mixture if it has the same distribution as the product of two independent random variables, one being positive and the other a standard Gaussian random variable. Examples of Gaussian mixtures include random variables with densities proportional to e−|t| p and symmetric p-stable random variables, where p ∈ (0, 2]. We obtain various sharp moment an...
متن کاملComplete Systems of Inequalities
In this paper we summarize the known results and the main tools concerning complete systems of inequalities for families of convex sets. We discuss also the possibility of using these systems to determine particular subfamilies of planar convex sets with specific geometric significance. We also analyze complete systems of inequalities for 3-rotationally symmetric planar convex sets concerning t...
متن کاملGaussian Measures of Dilations of Convex Rotation- Ally Symmetric Sets in Cn
Abstract We consider the complex case of the S-inequality. It concerns the behaviour of Gaussian measures of dilations of convex and rotationally symmetric sets in Cn. We pose and discuss a conjecture that among all such sets measures of cylinders (i.e. the sets {z ∈ Cn | |z1| ≤ p}) decrease the fastest under dilations. Our main result in this paper is that this conjecture holds under the addit...
متن کامل